Iterative Decoding Threshold Analysis for LDPC Convolutional Codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decoding LDPC Convolutional Codes on Markov Channels

This paper describes a pipelined iterative technique for joint decoding and channel state estimation of LDPC convolutional codes over Markov channels. Example designs are presented for the Gilbert-Elliott discrete channel model. We also compare the performance and complexity of our algorithm against joint decoding and state estimation of conventional LDPC block codes. Complexity analysis reveal...

متن کامل

Generalized threshold decoding of convolutional codes

It is shown that any rate lib systematic convolutional code over GF(p) can be decoded up to its minimum distance with respect to the decoding constraint length by a one-step threshold decoder. It is further shown that this decoding method can be generalized in a natural way to allow "decoding" of a received sequence in its unquantized analog form.

متن کامل

Codeword Structure Analysis for LDPC Convolutional Codes

The codewords of a low-density parity-check (LDPC) convolutional code (LDPC-CC) are characterised into structured and non-structured. The number of the structured codewords is dominated by the size of the polynomial syndrome former matrix H (D), while the number of the non-structured ones depends on the particular monomials or polynomials in H (D). By evaluating the relationship of the codeword...

متن کامل

Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channels

The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this paper. For MS decoding, the analysis is done by upper bounding the bit error probability of the root bit of a tree code by the sequence error probability of a subcode ...

متن کامل

Iterative Decoding Algorithms for RS-Convolutional Concatenated Codes

This paper presents an iterative decoding algorithm for concatenated codes consisting of a ReedSolomon and a convolutional code, focusing on the code of the DVB-S standard. Existing solutions for the different decoding stages and their interfaces are discussed and their performance is compared. Besides, a new procedure is proposed to define the feedback signal from the output of the Reed-Solomo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2010

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2010.2059490